37 research outputs found
A blind spot in undergraduate mathematics: The circular definition of the length of the circle, and how it can be turned into an enlightening example
We highlight the fact that in undergraduate calculus, the number pi is defined via the length of the circle, the length of the circle is defined as a certain value of an inverse trigonometric function, and this value is defined via pi, thus forming a circular definition. We present a way in which this error can be rectified. We explain that this error is instructive and can be used as an enlightening topic for discussing different approaches to mathematics with undergraduate students
Machine learning discovers invariants of braids and flat braids
We use machine learning to classify examples of braids (or flat braids) as
trivial or non-trivial. Our ML takes form of supervised learning using neural
networks (multilayer perceptrons). When they achieve good results in
classification, we are able to interpret their structure as mathematical
conjectures and then prove these conjectures as theorems. As a result, we find
new convenient invariants of braids, including a complete invariant of flat
braids.Comment: 24 page
Automated reasoning for proving non-orderability of groups
We demonstrate how a generic automated theorem prover can be applied to
establish the non-orderability of groups. Our approach incorporates various
tools such as positive cones, torsions, generalised torsions and cofinal
elements.Comment: 35 pages, 0 figure
Maths lecturers in denial about their own maths practice? A case of teaching matrix operations to undergraduate students
This case study provides evidence of an apparent disparity in the way that certain mathematics topics are taught compared to the way that they are used in professional practice. In particular, we focus on the topic of matrices by comparing sources from published research articles against typical undergraduate textbooks and lecture notes. Our results show that the most important operation when using matrices in research is that of matrix multiplication, with 33 of the 40 publications which we surveyed utilising this as the most prominent operation and the remainder of the publications instead opting not to use matrix multiplication at all rather than offering weighting to alternative operations. This is in contrast to the way in which matrices are taught, with very few of these teaching sources highlighting that matrix multiplication is the most important operation for mathematicians. We discuss the implications of this discrepancy and offer an insight as to why it can be beneficial to consider the professional uses of such topics when teaching mathematics to undergraduate students
Yes-no Bloom filter: A way of representing sets with fewer false positives
The Bloom filter (BF) is a space efficient randomized data structure
particularly suitable to represent a set supporting approximate membership
queries. BFs have been extensively used in many applications especially in
networking due to their simplicity and flexibility. The performances of BFs
mainly depends on query overhead, space requirements and false positives. The
aim of this paper is to focus on false positives. Inspired by the recent
application of the BF in a novel multicast forwarding fabric for information
centric networks, this paper proposes the yes-no BF, a new way of representing
a set, based on the BF, but with significantly lower false positives and no
false negatives. Although it requires slightly more processing at the stage of
its formation, it offers the same processing requirements for membership
queries as the BF. After introducing the yes-no BF, we show through
simulations, that it has better false positive performance than the BF
Mathematical mindsets increase student motivation: Evidence from the EEG
Mathematical mindset theory suggests learner motivation in mathematics may be increased by opening problems using a set of recommended ideas. However, very little evidence supports this theory. We explore motivation through self-reports while learners attempt problems formulated according to mindset theory and standard problems. We also explore neural correlates of motivation and felt-affect while participants attempt the problems. Notably, we do not tell participants what mindset theory is and instead simply investigate whether mindset problems affect reported motivation levels and neural correlates of motivation in learners. We find significant increases in motivation for mindset problems compared to standard problems. We also find significant differences in brain activity in prefrontal EEG asymmetry between problems. This provides some of the first evidence that mathematical mindset theory increases motivation (even when participants are not aware of mindset theory), and that this change is reflected in brain activity of learners attempting mathematical problems
Optimized hash for network path encoding with minimized false positives
The Bloom filter is a space efficient randomized data structure for representing a set and supporting membership queries. Bloom filters intrinsically allow false positives. However, the space savings they offer outweigh the disadvantage if the false positive rates are kept sufficiently low. Inspired by the recent application of the Bloom filter in a novel multicast forwarding fabric, this paper proposes a variant of the Bloom filter, the optihash. The optihash introduces an optimization for the false positive rate at the stage of Bloom filter formation using the same amount of space at the cost of slightly more processing than the classic Bloom filter. Often Bloom filters are used in situations where a fixed amount of space is a primary constraint. We present the optihash as a good alternative to Bloom filters since the amount of space is the same and the improvements in false positives can justify the additional processing. Specifically, we show via simulations and numerical analysis that using the optihash the false positives occurrences can be reduced and controlled at a cost of small additional processing. The simulations are carried out for in-packet forwarding. In this framework, the Bloom filter is used as a compact link/route identifier and it is placed in the packet header to encode the route. At each node, the Bloom filter is queried for membership in order to make forwarding decisions. A false positive in the forwarding decision is translated into packets forwarded along an unintended outgoing link. By using the optihash, false positives can be reduced. The optimization processing is carried out in an entity termed the Topology Manger which is part of the control plane of the multicast forwarding fabric. This processing is only carried out on a per-session basis, not for every packet. The aim of this paper is to present the optihash and evaluate its false positive performances via simulations in order to measure the influence of different parameters on the false positive rate. The false positive rate for the optihash is then compared with the false positive probability of the classic Bloom filter
Untangling Braids with Multi-Agent Q-Learning
We use reinforcement learning to tackle the problem of untangling braids. We experiment with braids with 2 and 3 strands. Two competing players learn to tangle and untangle a braid. We interface the braid untangling problem with the OpenAI Gym environment, a widely used way of connecting agents to reinforcement learning problems. The results provide evidence that the more we train the system, the better the untangling player gets at untangling braids. At the same time, our tangling player produces good examples of tangled braids